منابع مشابه
Ideal Perturbation Lemma
We explain the essence of perturbation problems. The key to understanding is the structure of chain homotopy equivalence – the standard one must be replaced by a finer notion which we call a strong chain homotopy equivalence. We formulate an Ideal Perturbation Lemma and show how both new and classical (including the Basic Perturbation Lemma) results follow from this ideal statement.
متن کاملOn the Perturbation Lemma, and Deformations
We have one more look at the perturbation lemma and we point out some non-standard consequences, including the relevance to deformations.
متن کاملReducing Computational Costs in the Basic Perturbation Lemma
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high computational costs. In this paper, we propose a general strategy in order to reduce the complexity in some important formulas (those following a specific pattern) obtained by this algorithm. Then, we show two examples o...
متن کاملRado's Selection Lemma Does not Imply the Boolean Prime Ideal Theorem
In this paper we consider the following combinatorial theorem of R. RADO [8] henceforth refered to as RL: Let .5 be a family of finite sets and suppose that to every finite subset F of 3 there wrresponds a choice function plF whose domain is F such that plF(T) E T for each T E F . (I.e., there exists a function pl whose domain is the set of finite subsets of 3 such that for each finite F E 8, p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2001
ISSN: 0092-7872,1532-4125
DOI: 10.1081/agb-100106814